Iterative Universal Rigidity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isometries, rigidity and universal covers

The goal of this paper is to describe all closed, aspherical Riemannian manifolds M whose universal covers M̃ have have a nontrivial amount of symmetry. By this we mean that Isom(M̃) is not discrete. By the well-known theorem of Myers-Steenrod [MS], this condition is equivalent to [Isom(M̃) : π1(M)] = ∞. Also note that if any cover of M has a nondiscrete isometry group, then so does its universal ...

متن کامل

Universal deformations, rigidity, and Ihara’s cocycle

In [Iha86b], Ihara constructs a universal cocycle Gal ( Q/Q ) −→ Zp[[t0, t1, t∞]]/ ((t0 + 1)(t1 + 1)(t∞ + 1)− 1) arising from the action of Gal ( Q/Q ) on certain quotients of the Jacobians of the Fermat curves

متن کامل

On Global Rigidity and Universal Rigidity of Generic Bar Frameworks with Few Vertices

Gale transform was successfully used to classify polytopes with few vertices; that is, r-dimensional polytopes with r + k vertices, where k is small. In this paper, we use Gale transform to classify r-dimensional generic bar frameworks with r + k vertices, where k ≤ 4; as universally rigid, globally rigid or nonglobally rigid.

متن کامل

Universal Iterative Methods for Computing Generalized Inverses

In this paper we construct a few iterative processes for computing {1, 2} inverses of a linear bounded operator, based on the hyper-power iterative method or the Neumann-type expansion. Under the suitable conditions these methods converge to the {1, 2, 3} or {1, 2, 4} inverses. Also, we specify conditions when the iterative processes converge to the Moore-Penrose inverse, the weighted Moore-Pen...

متن کامل

Iterative Universal Hash Function Generator for Minhashing

Minhashing is a technique used to estimate the Jaccard Index between two sets by exploiting the probability of collision in a random permutation. In order to speed up the computation, a random permutation can be approximated by using an universal hash function such as the ha,b function proposed by Carter and Wegman. A better estimate of the Jaccard Index can be achieved by using many of these h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2015

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-015-9670-5